Simple Deterministic Algorithms for Fully Dynamic Maximal Matching
نویسندگان
چکیده
منابع مشابه
Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching
We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph G = (V,E), with |V | = n and |E| = m, in o( √ m ) time per update. In particular, for minimum vertex cover we provide deterministic data structures for maintaining a (2+ ) approximation inO(log n/ ) amortized time per update. For maximum matching, we ...
متن کاملDynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms
We present a simple randomized reduction from fully-dynamic integral matching algorithms to fully-dynamic “approximately-maximal” fractional matching algorithms. Applying this reduction to the recent fractional matching algorithm of Bhattacharya, Henzinger, and Nanongkai (SODA 2017), we obtain a novel result for the integral problem. Specifically, our main result is a randomized fully-dynamic (...
متن کاملSimple deterministic wildcard matching
We present a simple and fast deterministic solution to the string matching with don’t cares problem. The task is to determine all positions in a text where a pattern occurs, allowing both pattern and text to contain single character wildcards. Our algorithm takes O(n logm) time for a text of length n and a pattern of length m and in our view the algorithm is conceptually simpler than previous a...
متن کاملSimple dynamic algorithms for Maximal Independent Set and other problems
Most graphs in real life keep changing with time. These changes can be in the form of insertion or deletion of edges or vertices. Such rapidly changing graphs motivate us to study dynamic graph algorithms. We study three fundamental graph problems in the dynamic setting, namely, Maximal Independent Set (MIS), Maximum Matching and Maximum Flows. We report surprisingly simple and efficient algori...
متن کاملParallel Algorithms for Maximal Independent Set and Maximal Matching
We present a derandomization process which leads to efficient parallel algorithms for the maximal independent set and maximal matching problems. The derandomization of the general pairs PROFIT/COST problem depends on the derandomization of the bit pairs PROFIT/COST problem which follows Luby’s approach of using an O(n) sized sample space. This simplifies the approach presented in [16].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2016
ISSN: 1549-6325,1549-6333
DOI: 10.1145/2700206